A Rgue ! - an Implemented System for Computer - Mediated Defeasible

نویسندگان

  • Bart Verheij
  • Han La Poutré
چکیده

This paper introduces the Argue!-system. It is an example of a system for computer-mediated defeasible argumentation, a new trend in the field of defeasible argumentation. In this research, computer systems are developed that can be used to mediate the process of argumentation of one or more users. Argument-mediation systems should be contrasted with systems for automated reasoning: the latter perform reasoning tasks for users, while the former play the more passive role of a mediator. E.g., mediation systems keep track of the arguments raised and of the justification status of statements. The argumentation theory underlying the system is based on CumulA, a procedural model of argumentation with arguments and counterarguments. The defeasibility of arguments is modeled in terms of argument structure and the attack relation between arguments, and completely independent of the underlying language. The process-model is free, in the sense that it allows not only inference (i.e., 'forward' argumentation, drawing conclusions), but also justification (i.e., 'backward' argumentation, adducing reasons). In the paper, the Argue!-system is presented from a 'bird's eye' view by focusing on the central ideas. The central user actions of the Argue!-system are inference, justification and attack. Conclusions are inferred from premises, issues are justified by adducing reasons, and arguments are attacked by counterarguments. Examples are given of the use of the Argue!-system as a philosophical tool. First, the question is raised whether the well-known difference between undercutters and rebutters still stands if defeat is purely interpreted in terms of argument structure (and answered positively). Second, it is argued that the indirect defeat of an argument (e.g., resulting from the defeat of an 'initial part' of the argument) should be terminologically distinguished from defeat by an undercutter. Third, the behavior of attack loops of even and odd length is studied. The paper ends with a comparison of the Argue!-system with existing systems, and a discussion of the relevance of computer-mediated defeasible argumentation. 1 Computer-mediated defeasible argumentation Defeasible argumentation can be regarded as a process of inference, justification and attack. When people argue, conclusions are inferred from premises, premises are justified by adducing reasons, and arguments are attacked by counterarguments. The understanding of defeasible argumentation has recently been significantly enhanced. Many researchers have devoted attention to the subject. The contributions of Reiter [1980], Pollock [1987, 1994, 1995], Loui [1991, 1992], Vreeswijk [1993, 1997], Dung [1993, 1995],

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Graphical Rule Authoring Tool for Defeasible Reasoning in the Semantic Web

Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is useful for many applications in the Semantic Web, such as policies and business rules, agent brokering and negotiation, ontology and knowledge merging, etc. However, the syntax of defeasible logic may appear too complex for many users. In this paper we present a ...

متن کامل

DR-DEVICE: A Defeasible Logic RDF Rule Language

Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology integration, where conflicting information arises naturally; and for the modeling of business rules and policies, where rules with exceptions are often used. In this demonstration we present a prototype system for defeasible rea...

متن کامل

DR-DEVICE: A Defeasible Logic System for the Semantic Web

This paper presents DR-DEVICE, a system for defeasible reasoning on the Web. Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology integration, where conflicting information arises naturally; and for the modeling of business rules and policies, where rules with exceptions are often...

متن کامل

A Defeasible Logic Reasoner for the Semantic Web

Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology integration, where conflicting information arises naturally; and for the modeling of business rules and policies, where rules with exceptions are often used. This paper describes these scenarios in more detail, and reports on th...

متن کامل

Isolated Persian/Arabic handwriting characters: Derivative projection profile features, implemented on GPUs

For many years, researchers have studied high accuracy methods for recognizing the handwriting and achieved many significant improvements. However, an issue that has rarely been studied is the speed of these methods. Considering the computer hardware limitations, it is necessary for these methods to run in high speed. One of the methods to increase the processing speed is to use the computer pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998